A note on the multiple-recursive matrix method for generating pseudorandom vectors
نویسندگان
چکیده
The multiple-recursive matrix method for generating pseudorandom vectors was introduced by Niederreiter (Linear Algebra Appl. 192 (1993), 301-328). We propose an algorithm for finding an efficient primitive multiplerecursive matrix method. Moreover, for improving the linear complexity, we introduce a tweak on the contents of the primitive multiple-recursive matrix method.
منابع مشابه
Pseudorandom Vector Generation by the Multiple-recursive Matrix Method
Pseudorandom vectors are of importance for parallelized simulation methods. In this paper we carry out an in-depth analysis of the multiplerecursive matrix method for the generation of uniform pseudorandom vectors which was introduced in an earlier paper of the author. We study, in particular, the periodicity properties, the lattice structure, and the behavior under the serial test for sequence...
متن کاملOn the Period Length of Pseudorandom Vector Sequences Generated by Matrix Generators
In Tahmi [5], Niederreiter [4], Afflerbach and Grothe [1], and Grothe [2] linear recursive congruential matrix generators for generating r-dimensional pseudorandom vectors are analyzed. In particular, conditions are established which ensure that the period length equals pr — 1 for any nonzero starting vector in case of a prime modulus p. For a modulus of the form pa, a > 2 and p prime, this pap...
متن کاملPseudorandom Number Generation by Inversive Methods
The classical linear congruential method for generating uniform pseudorandom numbers has some deficiencies that can render them useless for some simulation problems. This fact motivated the design and analysis of nonlinear congruential methods for the generation of pseudorandom numbers. Inversive methods are an interesting and very promising approach to produce uniform pseudorandom numbers. We ...
متن کاملIterations of Multivariate Polynomials and Discrepancy of Pseudorandom Numbers
In this paper we present an extension of a result in [2] about a discrepancy bound for sequences of s-tuples of successive nonlinear multiple recursive congruential pseudorandom numbers of higher orders. The key of this note is based on linear properties of the iterations of multivariate polynomials.
متن کاملThe Period Lengths of Inversive Congruential Recursions
They used this method as a nonlinear method to generate pseudorandom numbers. Niederreiter [10] generalized it over arbitrary finite field GF(q) when he studied pseudorandom vectors. See also Eichenauer-Herrmann [5] and Niederreiter [11, Chapters 8 and 10] and [12] for more details on these methods. Because the recursion (1) is used to construct pseudorandom numbers and pseudorandom vectors, th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 222 شماره
صفحات -
تاریخ انتشار 2017